By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Discrete Mathematics

Table of Contents
What Article options are available ?   View Cart   

Pair-Splitting Sets in $AG ( m,q )$

A. Beutelspacher, D. Jungnickel, P. C. van Oorschot, and S. A. Vanstone

pp. 451-459

Laplacian Permanents of Trees

Phillip Botti, Russel Merris, and Cheryl Vega

pp. 460-466

The 1/3–2/3 Conjecture for 5-Thin Posets

Graham Brightwell and Colin Wright

pp. 467-474

The Equivalent Subgraph and Directed Cut Polyhedra on Series-Parallel Graphs

Sunil Chopra

pp. 475-490

Covering Graphs by Cycles

Genghua Fan

pp. 491-496

How to Guess a Generating Function

Seyoum Getu, Louis W. Shapiro, Wen-jin Woan, and Leon C. Woodson

pp. 497-499

Some Results on Liu's Conjecture

Kwang S. Hong and Joseph Y.-T. Leung

pp. 500-523

2-Competition Graphs

Garth Isaak, Suh-Ryung Kim, Terry A. McKees, F. R. McMorris, and Fred S. Roberts

pp. 524-538

On the $p$-Edge Clique over Nuber of Complete Bipartite Graphs

Michael S. Jacobson

pp. 539-544

The Probabilistic Communication Complexity of Set Intersection

Bala Kalyanasundaram and Georg Schintger

pp. 545-557

A Tight Lower Bound on the Size of Planar Permutation Networks

Maria Klawe and Tom Leighton

pp. 558-563

Hamiltonian Properties of Grid Graphs

Christina Zamfirescu and Tudor Zamfirescu

pp. 564-570

Roots of the Reliability Polynomials

Jason I. Brown and Charles J. Colbourn

pp. 571-585

Labelling Graphs with a Condition at Distance 2

Jerrold R. Griggs and Roger K. Yeh

pp. 586-595

Implicat Representation of Graphs

Sampath Kannan, Moni Naor, and Steven Rudich

pp. 596-603